by type chronologically

Articles

Electronic Repositories

Book Chapters

  • Schröder, Matthias, Admissibly Represented Spaces and Qcb-Spaces, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 305-346

In Proceedings

  • Schröder, Matthias and Steinberg, Florian, Bounded time computation on metric spaces and Banach spaces, in: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, pages 1-12
  • Schröder, Matthias and Steinberg, Florian and Ziegler, Martin, Average-case bit-complexity theory of real functions, in: Kotsireas, Ilias S. and Rump, Siegfried M. and Yap, Chee K. (eds.), Mathematical aspects of computer and information sciences, vol. 9582 of Lecture Notes in Computer Science, Springer, Cham, 2016, pages 505-519
  • de Brecht, Matthew and Schröder, Matthias and Selivanov, Victor, Base-Complexity Classification of QCB_0-Spaces (Extended Abstract), in: Beckmann, Arnold and Mitrana, Victor and Soskova, Mariya (eds.), Evolving Computability, vol. 9136 of Lecture Notes in Computer Science, Springer, Cham, 2015, pages 156-166
  • Schröder, Matthias and Selivanov, Victor, Hyperprojective hierarchy of qcb_0-spaces, in: Beckmann, Arnold and Csuhaj-Varjú, Erzsébet and Meer, Klaus (eds.), Language, life, limits, vol. 8493 of Lecture Notes in Comput. Sci., Springer, Cham, 2014, pages 352-361
  • Battenfeld, Ingo and Schröder, Matthias, Observationally-induced effect monads: upper and lower powerspace constructions, in: Twenty-Seventh Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVII), vol. 276 of Electron. Notes Theor. Comput. Sci., Elsevier Sci. B. V., Amsterdam, 2011, pages 105-119
  • Schröder, Matthias, On the Relationship between Filter Spaces and Weak Limit Spaces, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), vol. 202 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 267-277
  • Schröder, Matthias, An Effective Tietze-Urysohn Theorem for QCB-Spaces (Extended Abstract), in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 231-242
  • Schröder, Matthias, Admissible representations of probability measures, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), Proceedings of the Third International Conference on Computability and Complexity in Analysis, vol. 167 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007, pages 61-78
  • Schröder, Matthias, On the Relationship between Filter Spaces and Weak Limit Spaces, in: Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch, Klaus and Zhong, Ning (eds.), CCA 2007, Fourth International Conference on Computability and Complexity in Analysis, vol. 338 of Informatik Berichte, FernUniversität in Hagen, 2007, pages 329-340
  • Schröder, Matthias, Admissible Representations in Computable Analysis, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 471-480
  • Schröder, Matthias, Admissible representations of probability measures, in: Cenzer, Douglas and Dillhage, Ruth and Grubba, Tanja and Weihrauch, Klaus (eds.), CCA 2006, Third International Conference on Computability and Complexity in Analysis, vol. 333 of Informatik Berichte, FernUniversität in Hagen, 2006, pages 249-264
  • Brattka, Vasco and Schröder, Matthias, Computing with Sequences, Weak Topologies and the Axiom of Choice, in: Ong, Luke (ed.), Computer science logic, vol. 3634 of Lecture Notes in Computer Science, Springer, 2005, pages 462-476
  • Kunkle, Daren and Schröder, Matthias, Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Proceedings of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2005, pages 111-123
  • Schröder, Matthias and Simpson, Alex, Representing probability measures using probabilistic processes, in: Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 326 of Informatik Berichte, FernUniversität in Hagen, 2005, pages 211-226
  • Kunkle, Daren and Schröder, Matthias, Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory, in: Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 320 of Informatik Berichte, FernUniversität in Hagen, 2004, pages 103-114
  • Schröder, Matthias, Spaces allowing type-2 complexity theory revisited, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning (eds.), Computability and Complexity in Analysis, vol. 302 of Informatik Berichte, FernUniversität in Hagen, 2003, pages 345-361
  • Schröder, Matthias, A Natural Weak Limit Space with Admissible Representation which is not a Limit Space, in: Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), CCA 2002 Computability and Complexity in Analysis, vol. 66 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002
  • Schröder, Matthias, Admissible Representations of Limit Spaces, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter (eds.), Computability and Complexity in Analysis, vol. 2064 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pages 273-295
  • Schröder, Matthias, Admissible Representations of Limit Spaces, in: Blanck, Jens and Brattka, Vasco and Hertling, Peter and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 272 of Informatik Berichte, FernUniversität Hagen, 2000, pages 369-388
  • Schröder, Matthias, Effective Metrization of Regular Spaces, in: Ko, Ker-I and Nerode, Anil and Pour-El, Marian B. and Weihrauch, Klaus and Wiedermann, Jiří (eds.), Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, FernUniversität Hagen, 1998, pages 63-80
  • Schröder, Matthias, Fast Online Multiplication of Real Numbers, in: Reischuk, Rüdiger and Morvan, Michel (eds.), STACS 97, vol. 1200 of Lecture Notes in Computer Science, Springer, Berlin, 1997, pages 81-92
  • Schröder, Matthias, Fast online real multiplication, in: Ko, Ker-I and Müller, Norbert and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, Universität Trier, 1996, pages 89-98
  • Schröder, Matthias, Topological spaces allowing type 2 complexity theory, in: Ko, Ker-I and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, vol. 190 of Informatik Berichte, FernUniversität Hagen, 1995, pages 41-53

Theses

  • Schröder, Matthias, The Coincidence Problem in Computable Analysis, Habilitation Thesis, Department of Mathematics, University of Darmstadt, Darmstadt, Germany, 2016
  • Schröder, Matthias, Admissible Representations for Continuous Computations, Ph.D. thesis, Fachbereich Informatik, FernUniversität Hagen, 2002

Edited Proceedings

  • Escardó, Martín and Pauly, Arno and Schröder, Matthias and Weihrauch, Klaus (eds.), Special issue: Selected papers of the Ninth International Conference on Computability and Complexity in Analysis (CCA) 2012, Held in Cambridge, June 24-27, 2012, Logical Methods in Computer Science, 2013/14
  • Brattka, Vasco and Ishihara, Hajime and Schröder, Matthias and Zhong, Ning (eds.), Computability and Complexity in Analysis, Selected Papers of the Fourth International Conference on Computability and Complexity in Analysis, June 16-18, 2007, Siena, Italy, vol. 14 of Journal of Universal Computer Science, Graz University of Technology, Graz, 2008
  • Brattka, Vasco and Ishihara, Hajime and Schröder, Matthias and Zhong, Ning (eds.), Computability and Complexity in Analysis, Selected Papers of the Fourth International Conference on Computability and Complexity in Analysis, June 16-18, 2007, Siena, Italy, vol. 54 of Mathematical Logic Quarterly, Wiley-VCH, Weinheim, 2008
  • Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus (eds.), Computability and Complexity in Analysis, 5th International Workshop, CCA 2002, Málaga, Spain, July 12-13, 2002, vol. 66(1) of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2002

Technical Reports

  • Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus and Zhong, Ning, Computability and Complexity in Analysis, technical report, FernUniversität in Hagen, Hagen, 2003
  • Schröder, Matthias, Admissible Representations for Continuous Computations, technical report, FernUniversität Hagen, Hagen, 2003
  • Brattka, Vasco and Schröder, Matthias and Weihrauch, Klaus, Computability and Complexity in Analysis, technical report, FernUniversität Hagen, Hagen, 2002
  • Schröder, Matthias, Welche topologischen Räume erlauben Typ2-Kom\-ple\-xi\-täts\-theorie?, technical report, FernUniversität Hagen, Hagen, 1995
This publication list has currently 54 entries